K-diagnosability of labeled Petri nets
نویسندگان
چکیده
This paper presents an approach to solve the problem of K-diagnosability of bounded labeled Petri nets (PNs). We first introduce extended incidence matrix, marking-eventing and extended state equation, which make it possible to record the number of event occurrences for any marking reachable from the initial one. Based on the proposed conceptions, we give a mathematical representation for labeled PNs to check diagnosability, and describe K-diagnosability problem of partially observed PNs. Then we propose a recursive algorithm for testing K-diagnosability of PNs, without construction of marking graph or diagnoser. Mots-clés : K-diagnosticabilité, systèmes à événements discrets, réseaux de Petri synchronisés
منابع مشابه
A New Approach for Diagnosability Analysis of Petri Nets Using Veri er Nets
In this paper we analyze the diagnosability properties of labeled Petri nets. We consider the standard notion of diagnosability of languages, requiring that every occurrence of an unobservable fault event be eventually detected, as well as the stronger notion of diagnosability in K steps, where the detection must occur within a xed bound of K event occurrences after the fault. We give necessary...
متن کاملOn K-diagnosability of Petri nets via integer linear programming
This paper deals with the problem of diagnosability of a fault after the firing of a finite number events (i.e., K-diagnosability). This problemcorresponds to diagnosability of a faultwithin a finite delay in the context of discrete event systems. The main contribution of this paper is a necessary and sufficient condition for K-diagnosability of bounded nets. The proposed approach exploits the ...
متن کاملDiagnosis of Labeled Time Petri Nets Using Time Interval Splitting
This paper deals with fault diagnosis of timed discrete event systems (TDESs), using a nondeterministic model named labeled time Petri net (LTPN). Thanks to a skillful splitting of time intervals assigned to the LTPN transitions, analyzing diagnosability in such a timed context can be performed using techniques from the untimed context. Moreover, a deterministic structure called augmented state...
متن کاملOF-PENDA: A Software Tool for Fault Diagnosis of Discrete Event Systems Modeled by Labeled Petri Nets
In this paper, a software tool to deal with diagnosis of discrete event systems (DESs) is presented. This tool called On-the-Fly PEtri-Net-based Diagnosability Analyzer (OF-PENDA) implements the techniques developed in [13] for the diagnosis of DESs modeled by labeled Petri nets (LPNs). This technique aims to cope with the state explosion problem which is a major issue when dealing with diagnos...
متن کاملThe Complexity of Diagnosability and Opacity Verification for Petri Nets
Diagnosability and opacity are two well-studied problems in discrete-event systems. We revisit these two problems with respect to expressiveness and complexity issues. We first relate different notions of diagnosability and opacity. We consider in particular fairness issues and extend the definition of Germanos et al. [ACM TECS, 2015] of weakly fair diagnosability for safe Petri nets to general...
متن کامل